Third-order phase transition in random tilings
نویسندگان
چکیده
منابع مشابه
High-order Phase Transition in Random Hypergrpahs
In this paper, we study the high-order phase transition in random r-uniform hypergraphs. For a positive integer n and a real p ∈ [0, 1], let H := H(n, p) be the random r-uniform hypergraph on the vertex set [n], where each r-set is an edge with probability p independently. For 1 ≤ s ≤ r − 1 and two s-sets S and S, we say S is connected to S if there is a sequence of alternating s-sets and edges...
متن کاملIs there a third - order phase transition in quenched QCD ?
We discuss the connection between the contributions of large field configurations and the large order behavior of perturbation theory. For quenched QCD, the sensitivity of the average plaquette to a removal of large field configurations has a narrow peak near β = 5.6. Various analysis of the order 10 weak coupling series for the plaquette give robust indications for a singularity in the third d...
متن کاملOrder-disorder phase transition in random-walk networks.
In this paper we study in detail the behavior of random-walk networks (RWN's). These networks are a generalization of the well-known random Boolean networks (RBN's), a classical approach to the study of the genome. RWN's are also discrete networks, but their response is defined by small variations in the state of each gene, thus being a more realistic representation of the genome and a natural ...
متن کاملThe Phase Transition for Dyadic Tilings
A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that for p sufficiently close to 1, there exists a set of pairwise disjoint available tiles whose union is the unit square, with probability tending to 1 as n → ∞,...
متن کاملPhase Transitions in Random Dyadic Tilings and Rectangular Dissections
We study rectangular dissections of an n × n lattice region into rectangles of area n, where n = 2 for an even integer k. We show that there is a natural edgeflipping Markov chain that connects the state space. A similar edge-flipping chain is also known to connect the state space when restricted to dyadic tilings, where each rectangle is required to have the form R = [s2, (s + 1)2]×[t2, (t+1)2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.88.042125